Latency Prediction for P2P Overlays
نویسنده
چکیده
Peer-to-peer (P2P) applications have become countless since they were initially proposed about ten years ago. They became popular among the general public when being used as a platform for file sharing. However, their robustness and scalability sparked interest from industry and research. Today these concepts drive some of the main businesses as back ends or migrate intensive workload away from them. Recently, Microsoft added P2P capabilities to their update mechanism. Adobe provides P2P APIs in their Flash product. Amazon’s Dynamo and Skype are two examples of commercial success in this area. One popular non-commercial example is the BitTorrent protocol. P2P is a movement “back to the roots” of the Internet. The early ARPANET was a system of equal computers providing services to each other. However, since that time the core assumptions have changed. In the first place, the Internet has changed dramatically in size. With the introduction of commercial Internet Service Providers in 1989 it became apparent that the Internet’s participants were no longer equally capable: Dedicated bandwidth-rich machines provided services to customer machines, connected via narrow-band dial-up links. Henceforth, the original P2P architecture was no longer applicable and the classical Client/Server architecture became the predominant model. With the rapid growth of the Internet even Client/Server suffered scalability issues. At the same time the consumer Internet access saw huge changes. Persistent dialup connections became common along with an increase of the offered bandwidth. Furthermore, academia introduced resilient algorithms that finally allowed the selforganisation of a large number of hosts. Hence, a “Renaissance” of the P2P paradigm began. Today Client/Server is still the predominant paradigm. Meanwhile, P2P has proven its capabilities and found adoption. Today’s P2P systems often avoid fully decentralized solutions and rather employ a hybrid approach. They employ central components to facilitate tasks such as a user management or billing. This central point creates a single point of failure, as illustrated during the recent Skype downtime of 2010. It may also constitute a bottleneck. Hence, today’s systems often use federated systems, for example, in cloud computing data centers. Despite P2P’s success, there exist only few software frameworks that support the development of truly distributed applications, such as FreePastry. Others such as OpenDHT are not maintained anymore. Often the P2P technique is tied to monolithic applications, such as the eMule client and is thus not reusable.
منابع مشابه
Adaptive dissemination of network state knowledge in structured peer-to-peer networks
One of the fundamental challenges in building Peer-to-Peer (P2P) applications is to locate resources across a dynamic set of nodes without centralised servers. Structured overlay networks solve this challenge by proving a key-based routing (KBR) layer that maps keys to nodes. The performance of KBR is strongly influenced by the dynamic and unpredictable conditions of P2P environments. To cope w...
متن کاملThe Design of Synchronization Mechanisms for Peer-to-Peer Massively Multiplayer Games
Massively multiplayer online games (MMG) are natural applications for peer-to-peer overlays (P2P). However, the absence of synchronization among the peers significantly limits games’ functionality and quality of service. Synchronization in P2P overlays faces problems including scalability, heterogeneous network latency and bandwidth, and non-collaborative participants. We believe these problems...
متن کاملA Performance Evaluation Framework for Mobile P2P Overlays under Churn
With the popular use of the mobile intelligence equipment, including smartphones and mobile tablets, mobile peer-to-peer (P2P) networks have become increasingly important. In recent years some mobile P2P overlays have been proposed. We propose a three-dimension evaluation framework for mobile P2P overlays under churn. Three P2P overlays, named as GIA, M-GIA, and KCCO(k-Clique Community Overlay)...
متن کاملImproving Topology-Aware Routing Efficiency in Chord
Due to their minimum consideration to an actual network topology, the existing peer-to-peer (P2P) overlay networks will lead to high latency and low efficiency. In TaChord, we present a study of topology-aware routing approaches in P2P overlays, and present an improved design in Chord. We evaluate TaChord and other algorithms by physical hops, interdomain-adjusted latency, and aggregate bandwid...
متن کاملSimilarity Discovery in Structured P2P Overlays
Peer-to-peer (P2P) overlays are appealing, since they can aggregate resources of end systems without relying on sophisticated infrastructures. Services can thus be rapidly deployed over such overlays. Primitive P2P overlays only support searches with single keywords. For queries with multiple keywords, presently only unstructured P2P systems can support by extensively employing message flooding...
متن کاملMapping the PPLive Network: Studying the Impacts of Media Streaming on P2P Overlays
While several deployed p2p le sharing overlays have been characterized in the literature, this paper shows that some of their conclusions may be false for p2p applications that stream media instead. Speci cally, we undertake a crawler-based investigation of PPLive, the largest live multimedia streaming system in the world today. It is important to understand IPTV overlays like PPLive in order...
متن کامل